| 翻訳と辞書 |
| kinetic closest pair ： ウィキペディア英語版 |
kinetic closest pair
A kinetic closest pair data structure is a kinetic data structure that maintains the closest pair of points, given a set ''P'' of ''n'' points that are moving continuously with time in a metric space. While many efficient algorithms were known in the static case, they proved hard to kinetize,〔
〕 so new static algorithms were developed to solve this problem.
== 2D case ==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「kinetic closest pair」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|